The Trimmed Iterative Closest Point Algorithm
نویسندگان
چکیده
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the Least Trimmed Squares (LTS) approach in all phases of the operation. Convergence is proved and an efficient implementation is discussed. TrICP is fast, applicable to overlaps under 50%, robust to erroneous measurements and shape defects, and has easy-to-set parameters. ICP is a special case of TrICP when the overlap parameter is 100%. Results of testing the new algorithm are shown.
منابع مشابه
Robust Euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm
The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called Trimmed ICP. The new algorithm is based on the consistent use of the Least Trimmed Squares approach in all phases of the operation. Conver...
متن کاملAutomated Trimmed Iterative Closest Point Algorithm
A novel method for automatic registration based on Iterative Closest Point (ICP) approach is proposed. This method uses geometric bounding containers to evaluate the optimum overlap rate of the data and model point sets.
متن کاملRobust Euclidean Alignment of 3D Point Sets
The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm 1 is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the Least Trimmed Squares (LTS) approach in all phases of the o...
متن کاملLieTrICP: An improvement of trimmed iterative closest point algorithm
We propose a robust registration method for two point sets using Lie group parametrization. Our algorithm is termed as LieTrICP, as it combines the advantages of the Trimmed Iterative Closest Point (TrICP) algorithm and Lie group representation. Given two low overlapped point sets, we first find the correspondence for every point, then select the overlapped point pairs, and use Lie group repres...
متن کاملFully automatic, robust and precise alignment of measured 3D surfaces for arbitrary orientations1)
We address the problem of Euclidean alignment of two partially overlapping surfaces represented by measured 3D point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [3] which is fast, applicable to overlaps under 50% and robust to erroneous and incomplete measurements. In this study, we combine the precision and robustnes...
متن کامل